Explore click models for search ranking.

Learning click models via probit bayesian inference.

Incorporating post%2Dclick behaviors into a click model.

A novel click model and its applications to online advertising.
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works focus on training the click model for individual queries, and cannot accurately model the tail queries due to the lack of training data. Simultaneously, most of the existing works consider the query, url and position, neglecting some other important attributes in click log data, such as the local time. Obviously, the click through rate is different between daytime and midnight. In this paper, we propose a novel click model based on Bayesian network, which is capable of modeling the tail queries because it builds the click model on attribute values, with those values being shared across queries. We called our work General Click Model (GCM) as we found that most of the existing works can be special cases of GCM by assigning different parameters. Experimental results on a largescale commercial advertisement dataset show that GCM can significantly and consistently lead to better results as compared to the state-of-the-art works.
Co%2Doptimization of multiple relevance metrics in web search.

To divide and conquer search ranking by learning query difficulty.

A general magnitude%2Dpreserving boosting algorithm for search ranking.

Inverse Time Dependency in Convex Regularized Learning.

P%2DpackSVM Parallel Primal grAdient desCent Kernel SVM.

Mining Translations of Web Queries from Web Click%2Dthrough Data.

Web query translation via web log mining.

Mining Web Query Hierarchies from Clickthrough Data.
In this paper, we propose to mine query hierarchies from clickthrough data, which is within the larger area of automatic acquisition of knowledge from the Web. When a user submits a query to a search engine and clicks on the returned Web pages, the user’s understanding of the query as well as its relation to the Web pages is encoded in the clickthrough data. With millions of queries being submitted to search engines every day, it is both important and beneficial to mine the knowledge hidden in the queries and their intended Web pages. We can use this information in various ways, such as providing query suggestions and organizing the queries. In this paper, we plan to exploit the knowledge hidden in clickthrough logs by constructing query hierarchies, which can reflect the relationship among queries. Our proposed method consists of two stages: generating candidate queries and determining “generalization/specialization” relations between these queries in a hierarchy. We test our method on some labeled data sets and illustrate the effectiveness of our proposed solution empirically.
Document Transformation for Multi%2Dlabel Feature Selection in Text Categorization.

